Partial spreads in random network coding

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Partial spreads in random network coding

ABSTRACT. Following the approach by R. Kötter and F. R. Kschischang, we study network codes as families of k-dimensional linear subspaces of a vector space Fq , q being a prime power and Fq the finite field with q elements. In particular, following an idea in finite projective geometry, we introduce a class of network codes which we call partial spread codes. Partial spread codes naturally gene...

متن کامل

On linear partial spreads

A linear partial spread is a set of mutually skew lines of some P(V ) – where V is a finite dimensional vector space over a field – that are characterized by the property that their images under the Plücker embedding are in a given subspace of P (∧2 V ); it is a linear spread if the lines in it cover the whole space. We will provide methods to construct linear partial spreads, and characterize ...

متن کامل

Infinite Maximal Partial Spreads

The concept of ‘critical deficiency’ of a finite net is generalized to the infinite case and a variety of infinite maximal partial spreads are constructed.

متن کامل

Partial ovoids and partial spreads in hermitian polar spaces

We present improved lower bounds on the sizes of small maximal partial ovoids in the classical hermitian polar spaces, and improved upper bounds on the sizes of large maximal partial spreads in the classical hermitian polar spaces. Of particular importance is the presented upper bound on the size of a maximal partial spread of H(3,q2). For q = 2, 3, the presented upper bound is sharp. For q = 3...

متن کامل

The Limitation of Random Network Coding

It is already known that in multicast (single source, multiple sinks) network, random linear network coding can achieve the maximum flow upper bound. In this paper, we investigate how random linear network coding behaves in general multi-source multi-sink case, where each sink has different demands, and we characterize all achievable rate of random linear network coding by a simple maximum flow...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Finite Fields and Their Applications

سال: 2014

ISSN: 1071-5797

DOI: 10.1016/j.ffa.2013.11.007